Completely uniformly distributed sequences based on de Bruijn sequences
نویسندگان
چکیده
منابع مشابه
On extending de Bruijn sequences
An indirect proof of part of Theorem 1 was first given by Leach in [11] with a topological and measure-theoretic argument on the set of real numbers corresponding to limits of frequency distribution sequences. In [7] Flaxman et al. use the graph-theoretical characterization of de Bruijn sequences to show that the extensions always exist in alphabets with at least three symbols. However, their p...
متن کاملDe Bruijn Sequences Revisited
A (non-circular) de Bruijn sequence w of order n is a word such that every word of length n appears exactly once in w as a factor. In this paper, we generalize the concept to different settings: the multi-shift de Bruijn sequence and the pseudo de Bruijn sequence. An m-shift de Bruijn sequence of order n is a word such that every word of length n appears exactly once in w as a factor that start...
متن کاملEnumerating De Bruijn Sequences
A cycle is a sequence taken in a circular order—that is, follows , and are all the same cycle as . Given natural numbers and , a cycle of letters is called a complete cycle [1, 2], or De Bruijn sequence, if subsequences consist of all possible ordered sequences over the alphabet . In 1946, De Bruijn proved [1] (see [2]) that the number of complete cycles, under , is equal to . We propose the ov...
متن کاملCoordination through De Bruijn sequences
Let μ be a rational distribution over a finite alphabet, and ( t χ ) be a n-periodic sequences which first n elements are drawn i.i.d. according to μ. We consider automata of bounded size that input 1 t χ − and output t y at stage t. We prove the existence of a constant C such that, whenever ln m m Cn ≥ , with probability close to 1 there exists an automaton of size m such that the empirical fr...
متن کاملFixed-density De Bruijn Sequences
De Bruijn sequences are circular strings of length 2 whose substrings are the binary strings of length n. Our focus is on de Bruijn sequences for binary strings that have the same density (number of 1s). We construct circular strings of length ( n−1 d )
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2020
ISSN: 0025-5718,1088-6842
DOI: 10.1090/mcom/3534